Guiding Synthesis Proofs
نویسندگان
چکیده
In this paper, we present a basic set of methods to guide a proof in the Whelk logic program synthesis system. Starting from the methods used in the Oyster/CL A M system, designed for a functional context, we developed some proof \critics" to solve the cases in which those methods are blocked in a relational context. The application of those methods and proof critics is illustrated by an example, the delete predicate synthesis.
منابع مشابه
Synthesis of Induction Orderings for Existence Proofs
In the eld of program synthesis inductive existence proofs are used to compute algorithmic deenitions for the skolem functions under consideration. While in general the recursion orderings of the given function deenitions form the induction ordering this approach often fail for existence proofs. In many cases a completely new induction ordering has to be invented to prove an existence formula. ...
متن کاملInvertibility in Sequent Calculi
The invertibility of the rules of a sequent calculus is important for guiding proof search and can be used in some formalised proofs of Cut admissibility. We present sufficient conditions for when a rule is invertible with respect to a calculus. We illustrate the conditions with examples. It must be noted we give purely syntactic criteria; no guarantees are given as to the suitability of the ru...
متن کاملExtensions to the Rippling-Out Tactic for Guiding Inductive Proofs
Citation for published version: Bundy, A, van Harmelen, F, Smaill, A & Ireland, A 1990, Extensions to the Rippling-Out Tactic for Guiding Inductive Proofs. in 10th International Conference on Automated Deduction: Kaiserslautern, FRG, July 24–27, 1990 Proceedings. vol. Lecture Notes in Artificial Intelligence No. 449, Lecture Notes in Computer Science, vol. 449, Springer-Verlag GmbH, pp. 132-146...
متن کاملFinding Simple Proofs in Logic Calculi
The design of search-guiding heuristics for theorem provers centers on minimizing the time required to nd any proof. Mathematicians, however, are also interested in simple proofs. Relevant simplicity criteria like proof length, for instance, hardly play a role in the design of heuristics. In this report we present heuristics designed to nd simple proofs and empirically evaluate their performanc...
متن کاملOrdinal Arithmetic: A Case Study for Rippling in a Higher Order Domain
This paper reports a case study in the use of proof planning in the context of higher order syntax. Rippling is a heuristic for guiding rewriting steps in induction that has been used successfully in the proof planning inductive of proofs using first order representations. Ordinal arithmetic provides a natural set of higher order examples on which transfinite induction may be attempted using ri...
متن کامل